The Generalized Connectivity of (n,k)-Bubble-Sort Graphs
نویسندگان
چکیده
منابع مشابه
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vert...
متن کاملMatching preclusion for the (n, k)-bubble-sort graphs
Eddie Cheng, László Lipták, Oakland University and David Sherman∗, Groves High School The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. We find this number for the (n, k)-bubble-sort graphs and classify all the optimal solutions.
متن کاملRun Time Bubble Sort – An Enhancement of Bubble Sort
In many real applications, sorting plays an important role as it makes easy to handle the data by arranging it in ascending or descending order, according to requirements. Bubble sort is most common sorting algorithm, but not efficient for many applications. There are number of other sorting algorithms and still, research is going for new sorting algorithms to improve the complexities of existi...
متن کاملEmbedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs
Bubble-sort, macro-star, and transposition graphs are interconnection networks with the advantages of star graphs in terms of improving the network cost of a hypercube. These graphs contain a star graph as their sub-graph, and have node symmetry, maximum fault tolerance, and recursive partition properties. This study proposes embedding methods for these graphs based on graph definitions, and sh...
متن کاملBubble Sort on SCMFSA
We present the bubble sorting algorithm using macro instructions such as the if-Macro (conditional branch macro instructions) and the TimesMacro (for-loop macro instructions) etc. The correctness proof of the program should include the proof of autonomic, halting and the correctness of the program result. In the three terms, we justify rigorously the correctness of the bubble sorting algorithm....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2018
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxy106